import java.util.HashMap;

/**
 * @Auther: wangliuyang
 * @Date: 2021/4/19 22:12
 * @Description:  两数之和
 */
public class Solution_1 {
    public int[] twoSum(int[] nums, int target) {
        HashMap<Integer, Integer> map = new HashMap<>();
        for (int i = 0; i < nums.length; i++) {
            if (map.containsKey(target - nums[i])) {
                return new int[]{map.get(target - nums[i]), i};
            }else {
                map.put(nums[i], i);
            }
        }
        return new int[]{};
    }
}
